Time-eecient State Space Search
نویسندگان
چکیده
We present two time-e cient state space algorithms for searching minimax trees. Because they are based on SSS* and Dual*, both dominate Alpha-Beta on a node count basis. Moreover, one of them is always faster in searching random trees, even when the leaf node evaluation time is negligible. The fast execution time is attributed to the recursive nature of our algorithms and to their e cient data structure (a simple array) for storing the bestrst node information. In practical applications with more expensive leaf evaluations we conjecture that the recursive state space search algorithms perform even better and might eventually supersede the popular directional search methods.
منابع مشابه
Eecient Detection of Global Properties in Distributed Systems Using Partial-order Methods
A new approach is presented for detecting whether a particular computation of an asyn-chronous distributed system satisses Poss (read \possibly "), meaning the system could have passed through a global state satisfying predicate , or Def (read \deenitely "), meaning the system deenitely passed through a global state satisfying. Detection can be done easily by straightforward state-space search;...
متن کاملStructured Cases, Trees and Eecient Retrieval
A set of eecient algorithms for case retrieval from a case base of trees labeled on both nodes and edges is proposed. They extend the best known algorithm for solving the subtree-isomorphism problem. A branch and bound technique and a general deenition of similarity between trees is considered. Both the case structure, i.e. the graph structure , and his semantic part, the labels, is taken into ...
متن کاملEecient State Space Search for Time Petri Nets
Partial-order reduction methods provide a number of well studied methods that have been succesfully applied to the state-space explosion problem that arises when analysing state based models of concurrent and reactive systems. The techniques have mainly been studied within the context of untimed systems, in the context of real-time systems little progress has been made. The main problem seems t...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملDriving on the Highway Driving on the Highway
| This paper deals with a particular kinodynamic 4] trajectory planning problem that we call thèhighway problem'. It consists in planning a time-optimal trajectory for a vehicle which is travelling in a structured workspace amidst other vehicles and is subject to constraints on its velocity and acceleration. By structured workspace, we mean that there exists lanes within which the vehicles are ...
متن کامل